COCOS’02, A Workshop on Global Constrained Optimization and Constraint Satisfaction, Held October 2–4, 2002, Sophia–Antipolis

نویسندگان

  • R. Baker Kearfott
  • R. B. Kearfott
  • Jürgen Garloff
  • Christian Jansson
چکیده

“This workshop focuses on complete solving techniques for continuous constraint satisfaction and optimization problems that provide all solutions with full rigor. Less rigorous solution techniques are not excluded, since they may be part of complete relevant techniques. Complete solution techniques guarantee that all the constraints – e.g. security or tolerance criteria – are satisfied and the global optima identified.” The conference was part of the “COCONUT” (COntinuous CONstraints – Updating the Technology) project, funded by the European Union,

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proceedings of the Workshop on Grid Systems , Tools and Environments , 12 October 2005 , Sophia Antipolis , France

The CoreGRID institute on Grid Systems, Tools, and Environments (STE) has held a workshop on the state of the art in its area of expertise during the Grids@Work’05 event in Sophia-Antipolis, on 12 October 2005. In this report, the workshop organizers present the proceedings volume of the workshop, containing the presented papers.

متن کامل

Benchmarking Global Optimization and Constraint Satisfaction Codes

A benchmarking suite describing over 1000 optimization problems and constraint satisfaction problems covering problems from different traditions is described, annotated with best known solutions, and accompanied by recommended benchmarking protocols for comparing test results.

متن کامل

Global Optimization and Constraint Satisfaction: The Branch-and-Reduce Approach

In the early 1990s, we proposed the integration of constraint programming and optimization techniques within the branch-and-bound framework for the global optimization of nonconvex nonlinear and mixedinteger nonlinear programs. This approach, referred to as branch-andreduce, was subsequently supplemented with a variety of branching and bounding schemes. In this paper, we review the theory and a...

متن کامل

GlobSol: History, Composition, and Advice on Use

The GlobSol software package combines various ideas from interval analysis, automatic differentiation, and constraint propagation to provide verified solutions to unconstrained and constrained global optimization problems. After briefly reviewing some of these techniques and GlobSol’s development history, we provide the first overall description of GlobSol’s algorithm. Giving advice on use, we ...

متن کامل

A comparison of complete global optimization solvers

Results are reported of testing a number of existing state of the art solvers for global constrained optimization and constraint satisfaction on a set of over 1000 test problems in up to 1000 variables.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002